Parallel Montgomery Multiplication in GF (2) using Trinomial Residue Arithmetic
نویسندگان
چکیده
We propose the first general multiplication algorithm in GF (2k) with a subquadratic area complexity of O(k8/5) = O(k1.6). We represent the elements of GF (2k) according to 2n pairwise prime trinomials, T1, . . . , T2n, of degree d, such that nd ≥ k. Our algorithm is based on Montgomery’s multiplication applied to the ring formed by the direct product of the n first trinomials.
منابع مشابه
Low-Complexity Parallel Systolic Montgomery Multipliers over GF(2m) Using Toeplitz Matrix-Vector Representation
In this paper, a generalized Montgomery multiplication algorithm in GF(2m) using the Toeplitz matrix-vector representation is presented. The hardware architectures derived from this algorithm provide low-complexity bit-parallel systolic multipliers with trinomials and pentanomials. The results reveal that our proposed multipliers reduce the space complexity of approximately 15% compared with an...
متن کاملGF(2) bit-parallel squarer using generalised polynomial basis for new class of irreducible pentanomials
Introduction: The squarer is an important circuit building block in square-and-multiply-based exponentiation and inversion circuits. When GF(2) elements are represented in a normal basis, squaring is simply a circular shift operation. Therefore, most previous works on squarers focused on other representations of GF(2) elements. For practical applications where values of n are often in the range...
متن کاملMontgomery Multiplier and Squarer in GF(2)
Montgomery multiplication in GF(2) is defined by a(x)b(x) r−1(x) mod f(x), where the field is generated by irreducible polynomial f(x), a(x) and b(x) are two field elements in GF(2), and r(x) is a fixed field element in GF(2). In this paper, first we present a generalized Montgomery multiplication algorithm in GF(2). Then by choosing r(x) according to f(x), we show that efficient architecture f...
متن کاملGF(2n) Bit-Parallel Squarer Using Generalized Polynomial Basis For a New Class of Irreducible Pentanomials
Introduction: Squarer is an important circuit building block in squareand-multiply-based exponentiation and inversion circuits. When GF (2n) elements are represented in a normal basis, squaring is simply a circular shift operation. Therefore, most previous works on squarers focused on other representations of GF (2n) elements. For practical applications where values of n are often in the range ...
متن کاملBit-Serial and Digit-Serial GF(2) Montgomery Multipliers using Linear Feedback Shift Registers
This work presents novel multipliers for Montgomery multiplication defined on binary fields GF(2). Different to state of the art Montgomery multipliers, this work uses a Linear Feedback Shift Register (LFSR) as the main building block. We studied different architectures for bit-serial and digit-serial Montgomery multipliers using the LFSR and the Montgomery factors x and xm−1. The proposed mult...
متن کامل